The fluid limit of the multiclass processor sharing queue
نویسندگان
چکیده
Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian processor sharing discipline. Building on prior work by Gromoll et al. [12] and Puha et al. [16], we establish the convergence of a properly normalized state process to a fluid limit. We show the existence of a unique solution to this fluid limit model, both for a stable and an overloaded queue. We also describe the asymptotic behavior of the trajectories of the fluid limit. Key-words: Processor Sharing, Fluid Limit ∗ Laboratoire de Mathématiques Raphaël Salem UMR 6085 CNRS-Université de Rouen, Avenue de l’Université, BP.12, F76801 Saint-Étienne-du-Rouvray, [email protected]. Part of this work was performed while the author was a CNRS Postdoctoral fellow at LIRMM. † INRIA and LIRMM, CNRS/Université Montpellier 2, 161 Rue Ada, F-34392 Montpellier, [email protected]. La limite fluide de la file d’attente Processor Sharing multiclasse Résumé : Dans une file d’attente “Processor Sharing”, chaque client présent reçoit une part égale de la capacité de service du serveur. Nous étudions le comportement de cette file quand il y a plusieurs classes de clients, susceptibles de ré-entrer dans la file quand leur service se termine. Les différentes classes sont caractérisées par des distributions de temps de service et des probabilités de routage différentes. A partir des résultats de Gromoll et al. [12] et Puha et al. [16], nous montrons l’existence de cette limite fluide, nous calculons les solutions de cette limite et nous décrivons ses propriétés asymptotiques. Mots-clés : Limite fluide, Processor Sharing The Fluid Limit of the Multiclass Processor Sharing Queue 3
منابع مشابه
Fluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model By
Under fairly general assumptions on the arrival and service time processes, we prove fluid and heavy traffic limit theorems for the unfinished work, queue length, sojourn time and waiting time processes associated with a single station multiclass generalized processor sharing model. The fluid limit of the unfinished work process is characterized by the Skorokhod map associated with a Skorokhod ...
متن کاملPopulation effects in multiclass processor sharing queues
Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian or the discriminatory processor sharing discipline. In this paper, we con...
متن کاملLaw of Large Number Limits of Limited Processor-Sharing Queues
Motivated by applications in computer and communication systems, we consider a processor sharing queue where the number of jobs served is not larger than K. We propose a measure-valued fluid model for this limited processor sharing queue and show that there exists a unique associated fluid model solution. In addition, we show that this fluid model arises as the limit of a sequence of appropriat...
متن کاملFluid approximations for a processor-sharing queue
This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...
متن کاملThe Fluid Limit of an Overloaded Processor Sharing Queue
This paper primarily concerns strictly supercritical fluid models, which arise as functional law of large numbers approximations for overloaded processor sharing queues. Analogous results for critical fluid models associated with heavily loaded processor sharing queues are contained in Gromoll et al. [9] and Puha and Williams [15]. An important distinction between critical and strictly supercri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 71 شماره
صفحات -
تاریخ انتشار 2012